Search for: All records

TheIsing modelof statistical physics has served as a keystone example of phase transitions, thermodynamic limits, scaling laws, and many other phenomena and mathematical methods. We introduce and explore anIsing game, a variant of the Ising model that features competing agents influencing the behavior of the spins. With long-range interactions, we consider a mean-field limit resulting in a nonlocal potential game at the mesoscopic scale. This game exhibits a phase transition and multiple constant Nash-equilibria in the supercritical regime. Our analysis focuses on a sharp interface limit for which potential minimizing solutions to the Ising game concentrate on two of the constant Nash-equilibria. We show that the mesoscopic problem can be recast as a mixed local/nonlocal space-time Allen-Cahn type minimization problem. We prove, using a Γ-convergence argument, that the limiting interface minimizes a space-time anisotropic perimeter type energy functional. This macroscopic scale problem could also be viewed as a problem of optimal control of interface motion. Sharp interface limits of Allen-Cahn type functionals have been well studied. We build on that literature with new techniques to handle a mixture of local derivative terms and nonlocal interactions. The boundary conditions imposed by the game theoretic considerations also appear as novel terms and require special treatment. 

We introduce and investigate certain N player dynamic games on the line and in the plane that admit Coulomb gas dynamics as a Nash equilibrium. Most significantly, we find that the universal local limit of the equilibrium is sensitive to the chosen model of player information in one dimension but not in two dimensions. We also find that players can achieve game theoretic symmetry through selfish behavior despite non-exchangeability of states, which allows us to establish strong localized convergence of the N-Nash systems to the expected mean field equations against locally optimal player ensembles, i.e., those exhibiting the same local limit as the Nash-optimal ensemble. In one dimension, this convergence notably features a nonlocal-to-local transition in the population dependence of the N-Nash system. 

In an era when big data are becoming the norm, there is less concern with the quantity but more with the quality and completeness of the data. In many disciplines, data are collected from heterogeneous sources, resulting in multi-view or multi-modal datasets. The missing data problem has been challenging to address in multi-view data analysis. Especially, when certain samples miss an entire view of data, it creates the missing view problem. Classic multiple imputations or matrix completion methods are hardly effective here when no information can be based on in the specific view to impute data for such samples. The commonly-used simple method of removing samples with a missing view can dramatically reduce sample size, thus diminishing the statistical power of a subsequent analysis. In this paper, we propose a novel approach for view imputation via generative adversarial networks (GANs), which we name by VIGAN. This approach first treats each view as a separate domain and identifies domain-to-domain mappings via a GAN using randomly-sampled data from each view, and then employs a multi-modal denoising autoencoder (DAE) to reconstruct the missing view from the GAN outputs based on paired data across the views. Then, by optimizing the GAN and DAE jointly, our model enables the knowledge integration for domain mappings and view correspondences to effectively recover the missing view. Empirical results on benchmark datasets validate the VIGAN approach by comparing against the state of the art. The evaluation of VIGAN in a genetic study of substance use disorders further proves the effectiveness and usability of this approach in life science.